Finite source Erlang based queueing systems: complementarity, equivalence and their implications

FINITE-SOURCE QUEUEING SYSTEMS AND THEIR APPLICATIONS A Bibliography

The aim of the present paper is to give a collection of some important results of finite-source queueing systems and their applications in solving several practical problems. Its main contribution is the bibliography of recent papers and books collected from different databases and private sources. It concentrates on both theoretical and practical developments and tries to supplement of several...

Analyzing Markov-Modulated Finite Source Queueing Systems

This paper deals with a First-Come, First-Served (FCFS) queueing model to analyze the steady-state behaviour of heterogeneous finite-source queueing system with a single server. The request sources and the server are supposed to operate in random environments, thus allowing the arrival and service processes to be Markov-modulated ones. Each request of the sources is characterized by its own exp...

On Finite-source Queueing Systems Operating in Random Environments

The simulation tool lcpSim can be used to investigate special level crossing problems of queueing systems of type HYPOk / HYPOr / 1 / /n embedded in different Markovian environments (recently referred to as Markov modulated ones). Our observed system consists of n heterogeneous machines (requests) and a server that "repairs" the broken machines according to the most commonly used service discip...

Finite Two Layered Queueing Systems

Equivalence and Decomposition in Queueing Systems - A Unified Approach

This paper is an attempt to cast in a unified framework several approximation techniques based on equivalence (aggregation) and decompositon that have been applied for the solution of queueing networks in the last decade or so. The main idea in the proposed framework is that it is possible, and useful, to view these techniques as involving two separate steps. Equivalence, the first step, is mer...